منابع مشابه
Inversion of Matrices over a Commutative Semiring
It is a well-known consequence of the elementary theory of vector spaces that if A and B are n-by-n matrices over a field (or even a skew field) such that AB = 1, then BA = 1. This result remains true for matrices over a commutative ring, however, it is not, in general, true for matrices over noncommutatives rings. In this paper we show that if A and B are n-by-n matrices over a commutative sem...
متن کاملDiameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring
Let S be a semiring and let Z(S)∗ be its set of nonzero zero divisors. We denote the zero divisor graph of S by Γ(S) whose vertex set is Z(S)∗ and there is an edge between the vertices x and y (x 6= y) in Γ(S) if and only if either xy = 0 or yx = 0. In this paper we study the zero divisor graph of the semiring of matrices Mn(B), (n > 1) over the Boolean semiring B. We investigate the properties...
متن کاملTropical convexity over max-min semiring
This is a survey on an analogue of tropical convexity developed over the max-min semiring, starting with the descriptions of max-min segments, semispaces, hyperplanes and an account of separation and non-separation results based on semispaces. There are some new results. In particular, we give new “colorful” extensions of the max-min Carathéodory theorem. In the end of the paper, we list some c...
متن کاملFactorization of Polynomials in One Variable over the Tropical Semiring
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization problem which are not polynomial time in the degree, but are polynomial time for polynomials of fixed degree. For two-variable polynomials we derive an irreduc...
متن کاملOn Semigroups of Matrices over the Tropical Semiring
The tropical semiring M consists of the set of natural numbers extended with innnity, equipped with the operations of taking minimums (as semiring addition) and addition (as semiring multiplication). We use factorization forests to prove niteness results related to semi-groups of matrices over M. Our method is used to recover results of Hashiguchi, Leung and the author in a uniied combinatorial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2017
ISSN: 0024-6107
DOI: 10.1112/jlms.12065